Rota’s Umbral Calculus and Recursions
نویسندگان
چکیده
Umbral Calculus can provide exact solutions to a wide range of linear recursions. We summarize the relevant theory and give a variety of examples from combinatorics in one, two and three variables.
منابع مشابه
9 F eb 1 99 5 Maple Umbral Calculus Package
Rota’s Umbral Calculus uses sequences of Sheffer polynomials to count certain combinatorial objects. We have developed a Maple package that implements Rota’s Umbral Calculus and some of its generalizations. A Mathematica version of this package is being developed in parallel.
متن کاملThe Umbral Transfer-Matrix Method, III: Counting Animals
This is the third part of the five-part saga on the umbral transfermatrix method, based on Gian-Carlo Rota’s seminal notion of the umbra. In this article we describe the Maple package ZOO that for any specific k, automatically constructs an umbral scheme for enumerating “k-board” lattice animals (polyominoes) on the two-dimensional square lattice. Such umbral schemes enable counting these impor...
متن کاملTHE UMBRAL TRANSFER-MATRIX METHOD V. The Goulden-Jackson Cluster Method for Infinitely Many Mistakes
This is the fifth, and last, installment of the saga on the Umbral Transfer-Matrix method, based on Gian-Carlo Rota’s seminal notion of the umbra. Here we extend the powerful GouldenJackson Cluster method, that enables one to compute generating functions enumerating words that avoid, as factors, any given finite set of “mistakes”, to the case where there are infinitely many mistakes. This infin...
متن کاملA Selected Survey of Umbral Calculus
We survey the mathematical literature on umbral calculus (otherwise known as the calculus of finite differences) from its roots in the 19th century (and earlier) as a set of “magic rules” for lowering and raising indices, through its rebirth in the 1970’s as Rota’s school set it on a firm logical foundation using operator methods, to the current state of the art with numerous generalizations an...
متن کاملUsing Rota’s Umbral Calculus to Enumerate Stanley’s P-Partitions
Leaving the generating function in terms of x1, . . . , xn is really displaying the whole (infinite!) set of compositions into n parts. Setting all the xi’s to be q we get that the generating function of cn(m) := number of compositions of m into exactly n non-negative parts, ∑∞ m=0 cn(m)q , equals (1− q)−n. A partition with n parts is an integer-vector (a1, . . . , an) with 0 ≤ a1 ≤ a2 ≤ . . . ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002